منابع مشابه
Once again on the equivalence theorem
We present the proof of the equivalence theorem in quantum field theory which is based on a formulation of this problem in the field-anitfield formalism. As an example, we consider a model in which a different choices of natural finite counterterms is possible, leading to physically non-equivalent quantum theories while the equivalent theorem remains valid.
متن کاملA Direct-Sum Theorem for Read-Once Branching Programs
We study a direct-sum question for read-once branching programs. If M(f) denotes the minimum average memory required to compute a function f(x1, x2, . . . , xn) how much memory is required to compute f on k independent inputs that arrive in parallel? We show that when the inputs are sampled independently from some domain X and M(f) = Ω(n), then computing the value of f on k streams requires ave...
متن کاملOnce and only once.
V enous thrombosis is a fairly common disorder that manifests mainly as deep vein thrombosis of the leg or pulmonary embolism. It affects 1 in 1000 individuals annually and has a substantial mortality rate. 1 Its causes are both genetic (prothrombotic abnormalities sometimes referred to as a group as thrombophilia) and acquired. 2 Among the latter are cancer, female hormone use, and all forms o...
متن کاملProving Parikh's theorem using Chomsky-Schutzenberger theorem
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.
متن کاملA Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2019
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-019-00664-z